Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(g(h(x, y)), f(a, a)) → f(h(x, x), g(f(y, a)))
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(g(h(x, y)), f(a, a)) → f(h(x, x), g(f(y, a)))
Q is empty.
We use [23] with the following order to prove termination.
Recursive path order with status [2].
Precedence:
g1 > h2 > f2
g1 > h2 > a
Status:
a: multiset
f2: multiset
g1: multiset
h2: [2,1]